Mathematics | 您所在的位置:网站首页 › converge in math › Mathematics |
Next Article in Journal
Deep Learning Nonhomogeneous Elliptic Interface Problems by Soft Constraint Physics-Informed Neural Networks
Previous Article in Journal
A Novel Coupled Meshless Model for Simulation of Acoustic Wave Propagation in Infinite Domain Containing Multiple Heterogeneous Media
Journals
Active Journals
Find a Journal
Proceedings Series
Topics
Information
For Authors
For Reviewers
For Editors
For Librarians
For Publishers
For Societies
For Conference Organizers
Open Access Policy
Institutional Open Access Program
Special Issues Guidelines
Editorial Process
Research and Publication Ethics
Article Processing Charges
Awards
Testimonials
Author Services
Initiatives
Sciforum
MDPI Books
Preprints.org
Scilit
SciProfiles
Encyclopedia
JAMS
Proceedings Series
About
Overview
Contact
Careers
News
Blog
Sign In / Sign Up
Notice
clear
Notice
You are accessing a machine-readable page. In order to be human-readable, please install an RSS reader. Continue Cancel clearAll articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess. Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for future research directions and describes possible research applications. Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the reviewers. Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal. ![]() ![]() ![]() ![]() ![]() ![]() Find support for a specific problem in the support section of our website. Get Support FeedbackPlease let us know what you think of our products and services. Give Feedback InformationVisit our dedicated information section to learn more about MDPI. Get Information clear JSmol Viewer clear first_page settings Order Article Reprints Font Type: Arial Georgia Verdana Font Size: Aa Aa Aa Line Spacing: Column Width: Background: Open AccessCommunication An Improved Convergence Condition of the MMS Iteration Method for Horizontal LCP of H+-Matrices by![]() ![]() Abstract: In this paper, inspired by the previous work in (Appl. Math. Comput., 369 (2020) 124890), we focus on the convergence condition of the modulus-based matrix splitting (MMS) iteration method for solving the horizontal linear complementarity problem (HLCP) with H + -matrices. An improved convergence condition of the MMS iteration method is given to improve the range of its applications, in a way which is better than that in the above published article. Keywords: horizontal linear complementarity problem; H+-matrix; the MMS iteration method MSC: 65F10; 90C33 1. IntroductionAs is known, the horizontal linear complementarity problem, for the given matrices A , B ∈ R n × n , is to find that two vectors z , w ∈ R n satisfy A z = B w + q ≥ 0 , z ≥ 0 , w ≥ 0 and z T w = 0 , where q ∈ R n is given, which is often abbreviated as HLCP. If A = I in (1), the HLCP (1) is no other than the classical linear complementarity problem (LCP) in [1], where I denotes the identity matrix. This implies that the HLCP (1) is a general form of the LCP.The HLCP (1), used as a useful tool, often arises in a diverse range of fields, including transportation science, telecommunication systems, structural mechanics, mechanical and electrical engineering, and so on, see [2,3,4,5,6,7]. In the past several years, some efficient algorithms have been designed to solve the HLCP (1), such as the interior point method [8], the neural network [9], and so on. Particularly, in [10], the modulus-based matrix splitting (MMS) iteration method in [11] was adopted to solve the HLCP (1). In addition, the partial motivation of the present paper is from complex systems with matrix formulation, see [12,13,14] for more details.Recently, Zheng and Vong [15] further discussed the MMS method, as described below.The MMS method [10,15]. Let Ω be a positive diagonal matrix and r > 0 , and let A = M A − N A and B = M B − N B be the splitting of matrices A and B, respectively. Assume that ( z ( 0 ) , w ( 0 ) ) is an arbitrary initial vector. For k = 0 , 1 , 2 , … until the iteration sequence ( z ( k ) , w ( k ) ) converges, compute ( z ( k + 1 ) , w ( k + 1 ) ) by z ( k + 1 ) = 1 r ( | x ( k + 1 ) | + x ( k + 1 ) ) , w ( k + 1 ) = 1 r Ω ( | x ( k + 1 ) | − x ( k + 1 ) ) , where x ( k + 1 ) is obtained by ( M A + M B Ω ) x ( k + 1 ) = ( N A + N B Ω ) x ( k ) + ( B Ω − A ) | x ( k ) | + r q . For the later discussion, some preliminaries are gone over. For a square matrix A = ( a i j ) ∈ R n × n , | A | = ( | a i j | ) , and 〈 A 〉 = ( 〈 a i j 〉 ) , where 〈 a i i 〉 = | a i i | and 〈 a i j 〉 = − | a i j | for i ≠ j . A matrix A = ( a i j ) ∈ R n × n is called a non-singular M-matrix if A − 1 ≥ 0 and a i j ≤ 0 for i ≠ j ; an H-matrix if its comparison matrix 〈 A 〉 is a non-singular M-matrix; an H + -matrix if it is an H-matrix with positive diagonals; and a strictly diagonally dominant (s.d.d.) matrix if | a i i | > ∑ j ≠ i | a i j | , i = 1 , 2 , … , n . In addition, A ≥ ( > ) B with A , B ∈ R n × n , means a i j ≥ ( > ) b i j for i , j = 1 , 2 , … , n .For the MMS method with H + -matrix, two new convergence conditions are obtained in [15], which are weaker than the corresponding convergence conditions in [10]. One of these is given below.Theorem 1 ([15]). Assume that A , B ∈ R n × n are two H + -matrices and Ω = d i a g ( ω j j ) ∈ R n × n with ω j j > 0 , i , 2 , … , n , | b i j | ω j j ≤ | a i j | ( i ≠ j ) a n d s i g n ( b i j ) = s i g n ( a i j ) , b i j ≠ 0 . Let A = M A − N A be an H-splitting of A, B = M B − N B be an H-compatible splitting of B, and M A + M B Ω be an H + -matrix. Then the MMS method is convergent, provided one of the following conditions holds:(a) Ω ≥ D A D B − 1 ;(b) Ω |
CopyRight 2018-2019 实验室设备网 版权所有 |